Powerful Simulated-Annealing Algorithm Locates Global Minimum of Protein-Folding Potentials from Multiple Starting Conformations
نویسنده
چکیده
Protein-folding potentials, designed with the explicit goal that the global energy minimum correspond to crystallographically observed conformations of protein molecules, may offer great promise toward calculating native protein structures. Achieving this promise, however, depends on finding an effective means of dealing with the multiple-minimum problem inherent in such potentials. In this study, a protein-foldingpotential test system has been developed that exhibits the properties of general protein-folding potentials yet has a unique well-defined global energy minimum corresponding to the crystallographically determined conformation of the test molecule. A simulated-annealing algorithm is developed that locates the global minimum of this potential in four of eight test runs from random starting conformations. Exploration of the energy-conformation surface of the potential indicates that it contains the numerous local minima typical of protein-folding potentials and that the global minimum is not easily located by conventional minimization procedures. When the annealing algorithm is applied to a previously developed actual folding potential to analyze the conformation of avian pancreatic polypeptide, a new conformer is located that is lower in. energy than any conformer located in previous studies using a variety of minimization techniques.
منابع مشابه
New Conformational Search Method Using Genetic Algorithm and Knot Theory for Proteins
We have proposed a parallel simulated annealing using genetic crossover as one of powerful conformational search methods, in order to find the global minimum energy structures for protein systems. The simulated annealing using genetic crossover method, which incorporates the attractive features of the simulated annealing and the genetic algorithm, is useful for finding a minimum potential energ...
متن کاملThe Energy Landscape of a BLN Protein with β-Hairpin Shape
Conformational space annealing (CSA) is applied in order to study a 22-residue BLN protein, folded into the native state of a β-hairpin. It has been a challenging problem to investigate the energy landscape of this BLN protein and to locate its global minimum (GM) since the system is highly frustrated. CSA successfully locates the GM for all 100 independent runs. The amount of computational eff...
متن کامل1 Convex Global Underestimation for Molecular Structure Prediction
Key problems in computational biology, including protein and RNA folding and drug docking, involve conformational searching. Current search methods Monte Carlo, Molecular Dynamics, Simulated Annealing, and Genetic Algorithms are too slow for protein folding by many orders of magnitude. They get stuck in kinetic traps. We describe a global optimization method, the CGU method, which appears to be...
متن کاملProtein Structure Prediction
Protein structure prediction from sequence remains a premiere computational problem for modern molecular biology. The papers in this session address ab initio folding simulations and theoretical studies, the use of known structures as a basis for prediction, and analysis of how and what we know (or don't) about those known structures. The \thermodynamic hypothesis" asserts that proteins fold to...
متن کاملProtein Folding Problem as Studied by New Simulation Algorithms
It is widely believed that the prediction of the three-dimensional structures of proteins from the årst principles is impossible. In this review we will discuss the strategy for attacking the protein folding problem based on all-atom models. Our approach consists of two aspects: the inclusion of accurate solvent eãects and the development of powerful simulation algorithms that can avoid getting...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991